Lindenmayer Systems
نویسنده
چکیده
In this chapter, the family of Lindenmayer systems is presented. Lindenmayer systems differ from the previously discussed grammars in two major ways – by requiring that productions be applied in parallel and by allowing for tables of sets of rules. These differences can be useful for applications in a broad variety of areas, including but not limited to modelling biological phenomena such as growth.
منابع مشابه
About Digital Images and Lindenmayer Systems
In this paper, we are studying deterministic context free Lindenmayer Systems used to describe commands to a device that generates black and white digital images. Instead of well-known methods of drawing, we will paint squares, not lines. In the final part of the paper, we will discuss some important properties of growth functions of D0L-systems. In addition, we turn the discussion to gray scal...
متن کاملFeedback Control in the Evolution of Generative Lindenmayer Systems
This paper discusses the incorporation of feedback and feedback control in the modeling of biological and robotic systems via Lindenmayer representations. Context-free, context-sensitive, parametric, context-sensitive parametric and context-sensitive parametric Lindenmayer systems under feedback control are discussed. Proposals are made on how to modify generative context-sensitive parametric L...
متن کاملOn Lindenmayer Systems with Dynamic Control of Parallelism
M-rate 0L systems are interactionless Lindenmayer systems together with a function assigning to every string a set of multisets of productions that may be applied simultaneously to the string. Also tabled and extended variants of M-rate 0L systems are considered. Some results concerning the computational power of these systems are presented supplementing those contained in [1].
متن کاملFormation (SPF-93) at Claremont, California Discovery of Rewrite Rules in Lindenmayer Systems and State Transition Rules in Cellular Automata via Genetic Programming
It is difficult to write programs for both Lindenmayer systems and cellular automata. This paper demonstrates the possibility of discovering the rewrite rule for Lindenmayer systems and the state transition rules for cellular automata by means of genetic programming. Genetic programming is an extension of the genetic algorithm in which computer programs are genetically bred to solve problems. W...
متن کاملIncorporating Lindenmayer systems for architectural development in a functional-structural tree model
LIGNUM is a functional-structural tree model that represents coniferous and broad-leaved trees with modelling units corresponding to the real structure of trees. The units are tree segments, axes, branching points and buds. Metabolic processes are explicitly related to the structural units in which they take place. This paper enhances the modelling capabilities of LIGNUM with the possibility to...
متن کامل